Popular Ranking
نویسندگان
چکیده
How do you aggregate the preferences of multiple agents in a fair manner? This is a question that has occupied researchers for several centuries. Suppose we have k voters who each give their preferences on n candidates. How should the candidates be ranked to best represent the input? Marquis de Condorcet [5] showed that there may not exist a “winner”: a candidate who beats all other candidates in a pairwise majority vote. Borda [4] and Condorcet [5] (and many others after them) proposed different ways of aggregating the preferences of the voters, and argued over which method is the right one. Only in the middle of the 20th century, Arrow [2] showed that there is no right method: there exists no aggregation method that simulataneously satisfies three natural criteria (non-dictatorship, independence of irrelevant alternatives and Pareto efficiency).
منابع مشابه
Academic Ranking with Web Mining and Axiomatic Analysis
Academic ranking is a public topic, such as for universities, colleges, or departments, which has significant educational, administrative and social effects. Popular ranking systems include the US News & World Report (USNWR), the Academic Ranking of World Universities (ARWU), and others. The most popular observables for such ranking are academic publications and their citations. However, a rigo...
متن کاملRanking and Suggesting Popular Itemsets in Mobile Stores Using Modified Apriori Algorithm
We considered the problem of ranking the popularity of items and suggesting popular items based on user feedback. User feedback is obtained by iteratively presenting a set of suggested items, and users selecting items based on their own preferences either the true popularity ranking of items, and suggest true popular items. We consider apriori algorithm with some modifications overcoming the co...
متن کاملRanking Models in Data Envelopment Analysis
Traditional data envelopment analysis models split decision making units into two basic groups, efficient and inefficient. They are based on solving linear optimization problems and currently they represent very popular tool for efficiency and performance evaluation. Efficiency scores of inefficient units allows their ranking but efficient units cannot be ranked directly because of their maximu...
متن کاملRankDCG: Rank-Ordering Evaluation Measure
Ranking is used for a wide array of problems, most notably information retrieval (search). Kendall’s τ , Average Precision, and nDCG are a few popular approaches to the evaluation of ranking. When dealing with problems such as user ranking or recommendation systems, all these measures suffer from various problems, including the inability to deal with elements of the same rank, inconsistent and ...
متن کاملRanking Preserving Hashing for Fast Similarity Search
Hashing method becomes popular for large scale similarity search due to its storage and computational efficiency. Many machine learning techniques, ranging from unsupervised to supervised, have been proposed to design compact hashing codes. Most of the existing hashing methods generate binary codes to efficiently find similar data examples to a query. However, the ranking accuracy among the ret...
متن کاملAutomated Ranking of Database Query Results
Ranking and returning the most relevant results of a query is a popular paradigm in Information Retrieval. We discuss challenges and investigate several approaches to enable ranking in databases, including adaptations of known techniques from information retrieval. We present results of preliminary experiments.
متن کامل